Concatenated Codes for Multiple Reads of a DNA Sequence

Optimal Scheduling for Multiple Serially Concatenated Codes

In this paper an algorithm is proposed that finds the optimal activation schedule for the component decoders for iterative decoding of systems with three or more serially concatenated codes. It is optimal in terms of minimizing the total decoding complexity required to reach the convergence point. It is also demonstrated that the convergence threshold can be found by combining several three-dim...

Multiple Sequence Alignment System for Pyrosequencing Reads

Pyrosequencing is among the emerging sequencing techniques, capable of generating upto 100,000 overlapping reads in a single run. This technique is much faster and cheaper than the existing state of the art sequencing technique such as Sanger. However, the reads generated by pyrosequencing are short in size and contain numerous errors. Furthermore, each read has a specific position in the refer...

Concatenated codes

Optimal Unequal Channel Protection for Multiple-Description Concatenated Codes

Multiple-description product codes, consisting of an erasure correction row code (e.g. Reed-Solomon code) and an error correction/detection column code (e.g. convolutional codes+CRC) have recently been introduced to protect progressive transmission of multimedia contents. The significance of this approach is its compatibility with and full use of the progressive nature of the rate-distortion sc...

Radio Losses for Concatenated Codes

The advent of higher powered spacecraft amplifiers and better ground receivers capable of tracking spacecraft carrier signals with narrower loop bandwidths requires better understanding of the carrier tracking loss (radio loss) mechanism of the concatenated codes used for deep-space missions. In this article, we present results of simulations performed for a (7,1/2), Reed–Solomon (255,223), int...